λ(n)-convex functions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Functions, Records and Compatibility in the λN Calculus

Subtyping, a fundamental notion for software reusability, establishes a classification of data according to a compatibility relationship. This relationship is usually associated with records. However, compatibility can be defined in other situations, involving for example enumerated types or concrete data types. We argue that the basic requirement for supporting compatibility is an interaction ...

متن کامل

ΛN scattering length from the reaction γd → K + Λn

The perspects of utilizing the strangeness-production reaction γd → K + Λn for the determination of the Λn low-energy scattering parameters are investigated. The spin observables that need to be measured in order to isolate the Λn singlet (1 S0) and triplet (3 S1) states are identified. Possible kinematical regions where the extraction of the Λn scattering lengths might be feasible are discussed.

متن کامل

Some Results on Convex Spectral Functions: I

In this paper, we give a fundamental convexity preserving for spectral functions. Indeed, we investigate infimal convolution, Moreau envelope and proximal average for convex spectral functions, and show that this properties are inherited from the properties of its corresponding convex function. This results have many applications in Applied Mathematics such as semi-definite programmings and eng...

متن کامل

JENSEN’S INEQUALITY FOR GG-CONVEX FUNCTIONS

In this paper, we obtain Jensen’s inequality for GG-convex functions. Also, we get in- equalities alike to Hermite-Hadamard inequality for GG-convex functions. Some examples are given.

متن کامل

L-convex Functions and M-convex Functions

In the field of nonlinear programming (in continuous variables) convex analysis [22, 23] plays a pivotal role both in theory and in practice. An analogous theory for discrete optimization (nonlinear integer programming), called " discrete convex analysis " [18, 17], is developed for L-convex and M-convex functions by adapting the ideas in convex analysis and generalizing the results in matroid ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1992

ISSN: 0022-247X

DOI: 10.1016/0022-247x(92)90272-f